Tiling and Scheduling of Three-level Perfectly Nested Loops with Dependencies on Heterogeneous Systems
نویسندگان
چکیده
منابع مشابه
Tiling and Scheduling of Three-level Perfectly Nested Loops with Dependencies on Heterogeneous Systems
Nested loops are one of the most time-consuming parts and the largest sources of parallelism in many scientific applications. In this paper, we address the problem of 3-dimensional tiling and scheduling of three-level perfectly nested loops with dependencies on heterogeneous systems. To exploit the parallelism, we tile and schedule nested loops with dependencies by awareness of computational po...
متن کاملUnimodular Transformations of Non-Perfectly Nested Loops
A framework is described in which a class of imperfectly nested loops can be restructured using unimodular transformations. In this framework, an imperfect loop nest is converted to a perfect loop nest using Abu-Sufah's Non-Basic-to-Basic-Loop transformation. Conditions for the legality of this transformation and techniques for their veriication are discussed. An iteration space, which extends ...
متن کاملTiling Nested Loops into Maximal Rectangular Blocks
techniques are described as follows. Wolfe discusses the techniques of strip mining and iteration space tiling [25], which organize the computations in the original loops into chunks of equal size to take advantage of vector registers, caches, or local memory. Nicolau [13] proposes a method called loop quantization to partition nested loops. King and Li [9] discuss the grouping of loop iteratio...
متن کاملScheduling Nested Loops with Data Prefetching
The performance of systems running computation intensive programs which contain nested loops is limited by long memory access latencies. Data Prefetching|the action to fetch data before they are used, is a technique to tolerate memory access latencies by overlapping ALU and memory operations. Software based prefetching schemes depend on compiler to explicitly insert special prefetching instruct...
متن کاملTowards Unimodular Transformations for Non-perfectly Nested Loops
In this paper we discuss a possibility to extend unimodular transformations to non-perfectly nested loops. The main idea behind this extension is to convert a non-perfectly nested loop into a perfectly nested one by moving code into to innermost loop and properly guarding it to avoid multiple execution. This form of the loop can be viewed as an intermediate form for the transformation. Having o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scalable Computing: Practice and Experience
سال: 2016
ISSN: 1895-1767
DOI: 10.12694/scpe.v17i4.1205